A Longstaff and Schwartz Approach to the Early Election Problem

نویسندگان

  • Elliot Tonkes
  • Dharma Lesmono
چکیده

In many democratic parliamentary systems, election timing is an important decision availed to governments according to sovereign political systems. Prudent governments can take advantage of this constitutional option in order to maximize their expected remaining life in power. The problem of establishing the optimal time to call an election based on observed poll data has been well studied with several solution methods and various degrees of modeling complexity. The derivation of the optimal exercise boundary holds strong similarities with the American option valuation problem from mathematical finance. A seminal technique refined by Longstaff and Schwartz in 2001 provided a method to estimate the exercise boundary of the American options using a Monte Carlo method and a least squares objective. In this paper, we modify the basic technique to establish the optimal exercise boundary for calling a political election. Several innovative adaptations are required to make the method work with the additional complexity in the electoral problem. The transfer of Monte Carlo methods from finance to determine the optimal exercise of real-options appears to be a new approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lévy-sheffer Systems and the Longstaff-schwartz Algorithm for American Option Pricing

Glasserman and Yu (Ann. Appl. Probab. 14, 2004, p. 2090) have investigated the mean square error in the Longstaff-Schwartz algorithm for American option pricing, assuming that the underlying process is (geometric) Brownian motion. In this note we provide similar convergence results for the standard Poisson, Gamma, Pascal, and Meixner processes, pointing out the connection of the problem to the ...

متن کامل

Convergence of Monte Carlo Algorithms for Pricing American Options

In this paper we study the convergence of the Longstaff-Schwartz algorithm for the valuation of American options. Our approach is based on empirical risk minimization initiated by Vapnik and Chervonenkis in the early 1970’s and empirical processes techniques. This allows us to prove convergence, derive error estimates and a Central Limit Theorem for the sample estimators. It also opens up a var...

متن کامل

Longstaff and Schwartz models for American Options

This thesis consists of two parts. In the first part the Longstaff and Schwartz least squares method (a Monte-Carlo method) for pricing American type options is investigated. The method is based on valuation through a comparison between the value of early exercise and the conditional expected value of continued possession. The result is regressed on a set of basis functions. In this paper the f...

متن کامل

Modeling and forecasting US presidential election using learning algorithms

The primary objective of this research is to obtain an accurate forecasting model for the US presidential election. To identify a reliable model, artificial neural networks (ANN) and support vector regression (SVR) models are compared based on some specified performance measures. Moreover, six independent variables such as GDP, unemployment rate, the president’s approval rate, and others are co...

متن کامل

Fast Estimates of Greeks from American Options: A Case Study in Adjoint Algorithmic Differentiation

In this article algorithmic differentiation is applied to compute the sensitivities of the price of an American option, which is computed by the Longstaff-Schwartz algorithm. Adjoint algorithmic differentiation methods speed up the calculation and make the results more accurate and robust compared to a finite difference approximation. However, adjoint computations require more memory due to the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • ADS

دوره 2012  شماره 

صفحات  -

تاریخ انتشار 2012